-
1 input semigroup
Математика: входная полугруппа -
2 input semigroup
мат. -
3 semigroup
мат.полугруппа, квазигруппа- almost unitary semigroup - completely simple semigroup - finitely convergent semigroup - finitely generated semigroup - finitely presented semigroup - fully reducible semigroup - left cancellative semigroup - left concentric semigroup - left zero semigroup - right cancellative semigroup - right concentric semigroup - right zero semigroup - self-adjoint semigroup - self-conjugate semigroup - semigroup of right translations - strongly continuous semigroup - strongly integrable semigroup - strongly measurable semigroup - strongly reversible semigroup - totally primitive semigroup - totally regular semigroup - totally simple semigroup - weakly reductive semigroup -
4 входная полугруппа
Большой англо-русский и русско-английский словарь > входная полугруппа
-
5 machine
1) машина; механизм; станок; агрегат2) машинка; устройство; аппарат3) машинный; станочный4) обрабатывать механически; обрабатывать резанием•- absorption refrigerating machine - approved shot-firing machine - automatic arc-welding machine - automatic assembly machine - automatic bar-stock machine - automatic cam-controlled machine - automatic casting machine - automatic chain-bending machine - automatic checking machine - automatic chucking machine - automatic cocoon-reading machine - automatic drawing-in machine - automatic half-hose machine - automatic hopper-feed machine - automatic hosiery machine - automatic multistation machine - automatic single-spindle machine - automatic single-station machine - automatic sorting machine - automatic tracer machine - automatic weighing machine - automatic welding machine - automatic winding machine - autonomous sequential machine - carton feeding machine - case assembling machine - case making machine - cask windlassing machine - casting cleaning machine - chain testing machine - cigarette making machine - cigarette packing machine - circular warp-knitting machine - claw trussing machine - cloth mellowing machine - cocoon winding machine - coil winding machine - compound-table milling machine - concentrate charging machine - conditional probability machine - continuous dyeing machine - continuously operating machine - core roll-over machine - cylinder sizing machine - cylinder warping machine - double-cutter shearing machine - double-faced winding machine - double-knife cutting machine - dough dividing machine - dough forming machine - dough molding machine - dough rolling machine - dough rounding machine - drop roller machine - dropwire cleaning machine - drum winding machine - duplex calculating machine - elevator washing machine - fish dressing machine - fish packing machine - flame-shape cutting machine - flat-and-back stripping machine - flax scutching machine - flax spreading machine - gang drilling machine - gantry cutting machine - machine with input - meat tenderizing machine - mechanical interlock machine - medium-range sprinkling machine - multiple-spot welding machine - multiroll straightening machine - network access machine - overhead charging machine - paddle wool-washing machine - pattern recognition machine - penetrating-type dyeing machine - reversed torsion machine - roller printing machine - roof ripping machine - rotary cutting machine - rotary filling machine - saddle stitch machine - section warping machine - shot blasting machine - shot welding machine - soap milling machine - stitch welding machine - syrup filling machine - tablet compressing machine - tape sizing machine - tobacco ripping machine - tobacco stringing machine - vacuum kneading machine - vacuum packing machine - vacuum refrigerating machine - vacuum seaming machine - yeast extruding machine
См. также в других словарях:
Semigroup action — In algebra and theoretical computer science, an action or act of a semigroup on a set is a rule which associates to each element of the semigroup a transformation of the set in such a way that the product of two elements of the semigroup (using… … Wikipedia
Semiautomaton — In mathematics and theoretical computer science, a semiautomaton is an automaton having only an input, and no output. It consists of a set Q of states, a set Σ called the input alphabet, and a function T: Q × Σ → Q called the transition function … Wikipedia
Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and … Wikipedia
Distributed parameter system — A distributed parameter system (as opposed to a lumped parameter system) is a system whose state space is infinite dimensional. Such systems are therefore also known as infinite dimensional systems. Typical examples are systems described by… … Wikipedia
Dirac delta function — Schematic representation of the Dirac delta function by a line surmounted by an arrow. The height of the arrow is usually used to specify the value of any multiplicative constant, which will give the area under the function. The other convention… … Wikipedia
Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Automata theory — Automata is defined as a system where energy, information and material is transformed, transmitted and used for performing some function without the direct participation of man .In theoretical computer science, automata theory is the study of… … Wikipedia
Exponentiation by squaring — Exponentiating by squaring is an algorithm used for the fast computation of large integer powers of a number. It is also known as the square and multiply algorithm or binary exponentiation. In additive groups the appropriate name is double and… … Wikipedia
Series (mathematics) — A series is the sum of the terms of a sequence. Finite sequences and series have defined first and last terms, whereas infinite sequences and series continue indefinitely.[1] In mathematics, given an infinite sequence of numbers { an } … Wikipedia
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
